Lecture 2 Sequence Similarity January 4 & 9 , 1996 Lecturer : Martin Tompa Notes : Elizabeth Walkup
نویسندگان
چکیده
Rotating notetaking: Notes are to be written up in LaTEX if you know it, or plain text if not, and sent by electronic mail to karp@cs, ruzzo@cs, or tompa@cs, as appropriate. (If in LaTEX, see the instructions in /homes/june/ruzzo/SHARED/590bi/lectures/DIRECTIONS. If in plain text, don’t worry much about mathematical formulas, figures, bibliography citations, etc.) Notes are due at noon the day following lecture, so that they may be distributed to the class as soon as possible.
منابع مشابه
Lecture 6 Multiple Sequence Similarity January 18 , 1996 Lecturer : Martin Tompa
An important motivation for studying the similarity among multiple strings is the fact that protein databases are often categorized by protein families. A protein family is a collection of proteins with similar structure (i.e., shape), similar function, or similar evolutionary history. When we have a newly sequenced protein, we would like to know to which family it belongs, as this provides hyp...
متن کاملLecture 4 Optimal Local Alignment , and Gaps January 11 , 1996 Lecturer : Martin Tompa
The dynamic programming algorithm for optimal local alignment is similar to the dynamic programming algorithm for optimal global alignment given in Section 3.3. It proceeds by filling in a table with the values of v(i; j), with i; j increasing. The value of each entry is calculated according to a new basis and recurrence for v(i; j), given below. Unlike the global alignment algorithm, however, ...
متن کاملLecture 3 Optimal Local Alignment , and Gaps January 11 , 1996 Lecturer : Martin Tompa
The dynamic programming algorithm for optimal local alignment is similar to the dynamic programming algorithm for optimal global alignment given in Section 2.6. It proceeds by filling in a table with the values of v(i; j), with i; j increasing. The value of each entry is calculated according to a new basis and recurrence for v(i; j), given below. Unlike the global alignment algorithm, however, ...
متن کاملLecture Notes on Biological Sequence Analysis
Bibliography 81 Preface These are the lecture notes from CSE 527, a graduate course on computational molecular biology I taught at the University of Washington in Winter 2000. The topic of the course was Biological Sequence Analysis. These notes are not intended to be a survey of that area, however, as there are numerous important results that I would have liked to cover but did not have time.
متن کاملLecture 3 Introduction to Sequence Similarity
The next few lectures will deal with the topic of “sequence similarity”, where the sequences under consideration might be DNA, RNA, or amino acid sequences. This is likely the most frequently performed task in computational biology. Its usefulness is predicated on the assumption that a high degree of similarity between two sequences often implies similar function and/or three-dimensional struct...
متن کامل